Search results for "finite [mass]"

INDUCTIVE INFERENCE OF LIMITING PROGRAMS WITH BOUNDED NUMBER OF MIND CHANGES

1996

We consider inductive inference of total recursive functions in the case, when produced hypotheses are allowed some finite number of times to change “their mind” about each value of identifiable function. Such type of identification, which we call inductive inference of limiting programs with bounded number of mind changes, by its power lies somewhere between the traditional criteria of inductive inference and recently introduced inference of limiting programs. We consider such model of inductive inference for EX and BC types of identification, and we study • tradeoffs between the number of allowed mind changes and the number of anomalies, and • relations between classes of functions ident…

Strain state analysis of InGaN/GaN - sources of error and optimized imaging conditions.

2006

Transmission electron microscopy investigation of the chemical composition of In x Ga 1-x N/GaN layers by strain state analysis can lead to substantial artefacts. We evaluated simulated images in dependence of specimen thickness, specimen orientation and objective lens defocus. We observed that the measurement is in agreement with the true strain profile for certain conditions only. An analysis of error sources revealed that artefacts are mainly caused by a combination of delocalization and the composition dependence of the phases of the beams contributing to the image formation. The delocalization effect is minimized for interference of the undiffracted beam with one of the 000 ± 2 beams. …

Toward a formalization of a two traders market with information exchange

2014

This paper shows that Hamiltonians and operators can also be put to good use even in contexts which are not purely physics based. Consider the world of finance. The work presented here {models a two traders system with information exchange with the help of four fundamental operators: cash and share operators; a portfolio operator and an operator reflecting the loss of information. An information Hamiltonian is considered and an additional Hamiltonian is presented which reflects the dynamics of selling/buying shares between traders. An important result of the paper is that when the information Hamiltonian is zero, portfolio operators commute with the Hamiltonian and this suggests that the dy…

First passage time distribution of stationary Markovian processes

2010

The aim of this paper is to investigate how the correlation properties of a stationary Markovian stochastic processes affect the First Passage Time distribution. First Passage Time issues are a classical topic in stochastic processes research. They also have relevant applications, for example, in many fields of finance such as the assessment of the default risk for firms' assets. By using some explicit examples, in this paper we will show that the tail of the First Passage Time distribution crucially depends on the correlation properties of the process and it is independent from its stationary distribution. When the process includes an infinite set of time-scales bounded from above, the FPT…

Formal verification of a Cooperative Automatic Repeat reQuest MAC protocol

2012

Author's version of an article published in the journal: Computer Standards & Interfaces. Also available from the publisher at: http://dx.doi.org/10.1016/j.csi.2011.12.001 Cooperative communications, in which a relay node helps the source node to deliver its packets to the destination node, are able to obtain significant benefits in terms of transmission reliability, coverage extension and energy efficiency. A Cooperative Automatic Repeat reQuest (C-ARQ) MAC protocol has been recently proposed to exploit cooperative diversity at the MAC layer. in this paper, we validate the integrity and the validity of the C-ARQ protocol using formal methods. The protocol logic is modeled in SDL and implem…

The First Main Theorem

1998

Khovanov homology for signed divides

2009

The purpose of this paper is to interpret polynomial invariants of strongly invertible links in terms of Khovanov homology theory. To a divide, that is a proper generic immersion of a finite number of copies of the unit interval and circles in a [math] –disc, one can associate a strongly invertible link in the [math] –sphere. This can be generalized to signed divides: divides with [math] or [math] sign assignment to each crossing point. Conversely, to any link [math] that is strongly invertible for an involution [math] , one can associate a signed divide. Two strongly invertible links that are isotopic through an isotopy respecting the involution are called strongly equivalent. Such isotopi…

Representation of Autonomous Automata

2001

An autonomous automaton is a finite automaton with output in which the input alphabet has cardinality one when special reduced. We define the transition from automata to semigroups via a representation successful if given two incomparable automata (neither simulate the other), the semigroups representing the automata are distinct. We show that representation by the transition semigroup is not successful. We then consider a representation of automata by semigroups of partial transformations. We show that in general transition from automata to semigroups by this representation is not successful either. In fact, the only successful transition presented is the transiton to this semigroup of par…

Stochastical Real Time Finite State Machine LPC for Planar Manipulator Control System Model estimation

2005

This paper presents a new stochastical real-time LPC (Last Principal Component) algorithm to estimate single-input-single-output (SISO) and multiple-input-multiple-output (MIMO) varying time models from input output data clusters of non stationary black boxes. Each of data clusters is on a time window. An application to estimate the control system model of a planar manipulator is developed. In fact many mathematical models of physical systems are non stationary such as industrial manipulator model. A real time estimation algorithm via stochastical LPC algorithm and an appraiser called "finite state machine" is then described For every data cluster the finite state machine updates the parame…

Size-intensive decomposition of orbital energy denominators

2000

We introduce an alternative to Almlöf and Häser’s Laplace transform decomposition of orbital energy denominators used in obtaining reduced scaling algorithms in perturbation theory based methods. The new decomposition is based on the Cholesky decomposition of positive semidefinite matrices. We show that orbital denominators have a particular short and size-intensive Cholesky decomposition. The main advantage in using the Cholesky decomposition, besides the shorter expansion, is the systematic improvement of the results without the penalties encountered in the Laplace transform decomposition when changing the number of integration points in order to control the convergence. Applications will…